Lexicalization and Generative Power in CCG
نویسندگان
چکیده
Marco Kuhlmann, Alexander Koller and Giorgio Satta, Lexicalization and Generative Power in CCG, 2015, Computational linguistics Association for Computational Linguistics (Print), (41), 2, 215-247. http://dx.doi.org/10.1162/COLI_a_00219 Copyright: Massachusetts Institute of Technology Press (MIT Press): STM Titles / MIT Press http://mitpress.mit.edu/main/home/default.asp?sid=19E29805-C0A0-4642-8ECDBACF5ADFF807
منابع مشابه
Statistical Parsing for CCG with Simple Generative Models
This paper presents a statistical parser for a wide-coverage Combinatory Categorial Grammar (CCG) derived from the Penn Treebank. The Treebank is translated to a corpus of canonical CCG derivations. We de ne a generative statistical model over CCG derivations and train it on the transformed Treebank. This model is evaluated using Parseval measures and the accuracy of recovery of word-word depen...
متن کاملDependency Trees and the Strong Generative Capacity of CCG
We propose a novel algorithm for extracting dependencies from the derivations of a large fragment of CCG. Unlike earlier proposals, our dependency structures are always tree-shaped. We then use these dependency trees to compare the strong generative capacities of CCG and TAG and obtain surprising results: Both formalisms generate the same languages of derivation trees – but the mechanisms they ...
متن کاملParsing with Generative Models of Predicate-Argument Structure
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. This paper argues that probabilistic parsers should therefore model the dependencies in the predicate-argument structure, as in the model of Clark et al. (2002), and defines a generative model for CCG derivations that c...
متن کاملGenerative Power of CCGs with Generalized Type-Raised Categories
This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to the standard CCGs not involving variables. The proof is based on the idea that any instance of such a grammar can be simulated by a standard CCG.
متن کاملGenerative Models for Statistical Parsing with Combinatory Categorial Grammar
This paper compares a number of generative probability models for a widecoverage Combinatory Categorial Grammar (CCG) parser. These models are trained and tested on a corpus obtained by translating the Penn Treebank trees into CCG normal-form derivations. According to an evaluation of unlabeled word-word dependencies, our best model achieves a performance of 89.9%, comparable to the figures giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Linguistics
دوره 41 شماره
صفحات -
تاریخ انتشار 2015